1206B - Make Product Equal One - CodeForces Solution


dp implementation *900

Please click on ads to support us..

Python Code:

input()
c=1
s=d=0
for x in map(int,input().split()):c&=x!=0;d^=x<0;s+=(x-1,abs(x+1))[x<1]
print(s+c*d*2)

C++ Code:

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

using ll = long long;

void resolve() {
    ll n;
    cin >> n;
    ll res = 0;
    ll cntNeg = 0;
    bool wasZero = false;
    for (ll i = 0; i < n; ++i) {
        ll x;
        cin >> x;
        res += abs(abs(x) - 1);
        cntNeg += x < 0;

        if (!x) {
            wasZero = true;
        }
    }

    res += ((cntNeg & 1) << 1LL) * (!wasZero);
    cout << res << '\n';
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    resolve();
    return 0;
}


Comments

Submit
0 Comments
More Questions

698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation
1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate
1352E - Special Elements
1520E - Arranging The Sheep
1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling